Triangle-free graphs with no six-vertex induced path
نویسندگان
چکیده
The graphs with no five-vertex induced path are still not understood. But in the triangle-free case, we can do this and one better; we give an explicit construction for all triangle-free graphs with no six-vertex induced path. Here are two examples: the 16-vertex Clebsch graph, and the graph obtained from a complete bipartite graph by subdividing a perfect matching. We show that every connected triangle-free graph with no six-vertex induced path is an induced subgraph of one of these two (modulo some twinning and duplication).
منابع مشابه
Three-coloring graphs with no induced seven-vertex path II : using a triangle
In this paper we give a polynomial time algorithm which determines if a given graph containing a triangle and no induced seven-vertex path is 3-colorable, and gives an explicit coloring if one exists. This is the second paper in a series of two. The first one, [3] is also submitted to this journal. In [2, 3], a polynomial time algorithm is given for three-coloring triangle-free graphs with no i...
متن کاملThree-coloring graphs with no induced seven-vertex path I : the triangle-free case
In this paper, we give a polynomial time algorithm which determines if a given triangle-free graph with no induced seven-vertex path is 3-colorable, and gives an explicit coloring if one exists.
متن کاملLong heterochromatic paths in heterochromatic triangle free graphs ∗
In this paper, graphs under consideration are always edge-colored. We consider long heterochromatic paths in heterochromatic triangle free graphs. Two kinds of such graphs are considered, one is complete graphs with Gallai colorings, i.e., heterochromatic triangle free complete graphs; the other is heterochromatic triangle free graphs with k-good colorings, i.e., minimum color degree at least k...
متن کاملOn the chromatic number of wheel-free graphs with no large bipartite graphs
A wheel is an induced cycle C plus a vertex connected to at least three vertices of C. Trotignon [14] asked if the class of wheel-free graphs is χ-bounded, i.e. if the chromatic number of every graph with no induced copy of a wheel is bounded by a function of its maximal clique. In this paper, we prove a weaker statement: for every `, the class of graphs with no induced wheel and no induced K`,...
متن کاملInduced Colorful Trees and Paths in Large Chromatic Graphs
In a proper vertex coloring of a graph a subgraph is colorful if its vertices are colored with different colors. It is well-known that in every proper coloring of a k-chromatic graph there is a colorful path Pk on k vertices. If the graph is k-chromatic and triangle-free then in any proper coloring there is also a path Pk which is an induced subgraph. N.R. Aravind conjectured that these results...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017